Constrained High-Index Saddle Dynamics for the Solution Landscape with Equality Constraints
نویسندگان
چکیده
We propose a constrained high-index saddle dynamics (CHiSD) method to search for index-k points of an energy functional subject equality constraints. With Riemannian manifold tools, the CHiSD is derived in minimax framework, and its linear stability at point proved. To ensure property, numerically implemented using retractions vector transport. Then we present numerical approach by combining with downward upward algorithms construct solution landscape presence apply Thomson problem Bose–Einstein condensation as examples demonstrate efficiency proposed method.
منابع مشابه
Constrained shrinking dimer dynamics for saddle point search with constraints
In this paper, we study the constrained shrinking dimer dynamics (CSDD) which leads to numerical procedures for locating saddle points (transition states) associated with an energy functional defined on a constrained manifold. We focus on the most generic case corresponding to a constrained stationary point where the projected Hessian of the energy onto the tangent hyperplane of the constrained...
متن کاملOn the Solution of Equality Constrained Quadratic Programming Problems Arising in Optimization Equality Constrained Quadratic Programming Problems Arising in Optimization
We consider the application of the conjugate gradient method to the solution of large equality constrained quadratic programs arising in nonlinear optimization. Our approach is based on a reduced linear system and generates iterates in the null space of the constraints. Instead of computing a basis for this null space, we choose to work directly with the matrix of constraint gradients, computin...
متن کاملControl Problems with Equality Constraints
not available at time of publication. Dimitris Bertsimas Massachusetts Insitute of Technology [email protected] MS8 Less is More: Robustness and Sparsity in Multivariate Statistics We describe applications of robust optimization in the context of machine learning, with a focus on classification and regression, principal component analysis and fitting of graphical models. In these tasks, sparsity...
متن کاملEntailment with Conditional Equality Constraints
Equality constraints (unification constraints) have widespread use in program analysis, most notably in static polymorphic type systems. Conditional equality constraints extend equality constraints with a weak form of subtyping to allow for more accurate analyses. We give a complete complexity characterization of the various entailment problems for conditional equality constraints. Additionally...
متن کاملNegative Set Constraints with Equality
Systems of set constraints describe relations between sets of ground terms. They have been successfully used in program analysis and type inference. So far two proofs of decidability of mixed set constraints have been given: However, both these proofs are long, involved and do not seem to extend to more general set constraints. Our approach is based on a reduction of set constraints to the mona...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Scientific Computing
سال: 2022
ISSN: ['1573-7691', '0885-7474']
DOI: https://doi.org/10.1007/s10915-022-01838-3